- strong algorithm
- криптографически стойкий (криптостойкий) алгоритм
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
strong algorithm
Смотреть что такое "strong algorithm" в других словарях:
Strong cryptography — or cryptographically strong are general terms applied cryptographic systems or components that are considered highly resistant to cryptanalysis. Demonstrating the resistance of any cryptographic scheme to attack is a complex matter, requiring… … Wikipedia
Strong secrecy — is a term used in cryptography. Bruno Blanchet provides the following definition:: Strong secrecy means that an adversary cannot see any difference when the value of the secret changes [Blanchet, B. (2004) Automatic proof of strong secrecy for… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Strong prime — In mathematics, a strong prime is a prime number with certain special properties. The definitions of strong primes are different in cryptography and number theory. Definition in cryptography In cryptography, a prime number p is strong if the… … Wikipedia
Strong pseudoprime — In number theory, a strong pseudoprime is a composite number that passes a pseudoprimality test. All primes pass this test, but a small fraction of composites pass as well, making them false primes . Unlike the Fermat pseudoprimes, for which… … Wikipedia
Strong generating set — Let G leq S n be a permutation group. Let : B = (eta 1, eta 2, ldots, eta r) be a sequence of distinct integers, eta i in { 1, 2, ldots, n } , such that the pointwise stabilizer of B is trivial (ie: let B be a base for G ). Define : B i =… … Wikipedia
Karplus-Strong string synthesis — is a method of physical modelling synthesis that loops a short waveform through a filtered delay line to simulate the sound of a hammered or plucked string or some types of percussion.Although it is useful to view this as a subtractive synthesis… … Wikipedia
Cryptographically strong — This term cryptographically strong is often used to describe an encryption algorithm, and implies, in comparison to some other algorithm (which is thus cryptographically weak), greater resistance to attack. But it can also be used to describe… … Wikipedia
Constraint algorithm — In mechanics, a constraint algorithm is a method for satisfying constraints for bodies that obey Newton s equations of motion. There are three basic approaches to satisfying such constraints: choosing novel unconstrained coordinates ( internal… … Wikipedia
Adversary (online algorithm) — In computer science, an online algorithm measures its competitiveness against different adversary models. For deterministic algorithms, the adversary is the same, the adaptive offline adversary. For randomized online algorithms competitiveness… … Wikipedia
